Graph Theory Matrix Approach – A Review

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a nurse rostering problem considering nurses preferences by graph theory approach

Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...

متن کامل

A novel technique to solve the supplier selection problem: combination of decision making trial and evaluation laboratory and graph theory and matrix approach methods

Considering the major change occurred in business cells from plant to “chain” and the critical need to choose the best partners to form the supply chain for competing in today’s business setting, one of the vital decisions made at the early steps of constructing a business is supplier selection. Given the fact that the early decisions are inherently strategic and therefore hard and costly to c...

متن کامل

Laplacian Matrix in Algebraic Graph Theory

In this paper we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are una...

متن کامل

A graph theoretic approach to matrix inversion by partitioning

Let M be a square matrix whose entries are in some field. Our object is to find a permutat ion matrix P such that P M P -x is completely reduced, i.e., is partitioned in block triangular form, so that all submatrices below its diagonal are 0 and all diagonal submatrices are square and irreducible. Let .4 be the binary (0, t) matrix obtained from M by preserving the O's of M and replacing the no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indian Journal of Science and Technology

سال: 2016

ISSN: 0974-5645,0974-6846

DOI: 10.17485/ijst/2016/v9i16/79236